Krylov-Schur-Type Restarts for the Two-Sided Arnoldi Method
نویسندگان
چکیده
We consider the two-sided Arnoldi method and propose a two-sided Krylov–Schurtype restarting method. We discuss the restart for standard Rayleigh–Ritz extraction as well as harmonic Rayleigh–Ritz extraction. Additionally, we provide error bounds for Ritz values and Ritz vectors in the context of oblique projections and present generalizations of, e.g., the Bauer–Fike theorem and Saad’s theorem. Applications of the two-sided Krylov–Schur method include the simultaneous computation of left and right eigenvectors and the computation of eigenvalue condition numbers. We demonstrate how the method can be used to find the least sensitive eigenvalues of a nonnormal matrix and how to approximate pseudospectra by using left and right shift-invariant subspaces. The results demonstrate that significant improvements in quality can be obtained over approximations with the (one-sided) Krylov–Schur method.
منابع مشابه
A Krylov-Schur Algorithm for Matrix Products?
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which employs reordered Schur decompositions to perform restarts and deflations in a numerically reliable manner. This paper describes a variant of the Krylov-Schur algorithm suitable for addressing eigenvalue problems associated with products of large and sparse matrices. It per...
متن کاملA periodic Krylov-Schur algorithm for large matrix products
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which employs reordered Schur decompositions to perform restarts and deflations in a numerically reliable manner. This paper describes a variant of the Krylov-Schur algorithm suitable for addressing eigenvalue problems associated with products of large and sparse matrices. It per...
متن کاملAn Inexact Krylov-Schur Algorithm for the Unitary Eigenvalue Problem
We present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpairs of large unitary matrices. The approximating Krylov spaces are built using short-term recurrences derived from Gragg’s isometric Arnoldi process. The implicit restarts are done by the KrylovSchur methodology of Stewart. All of the operations of the restart are done in terms of the Schur parameters ge...
متن کاملTwo-Sided Arnoldi in Order Reduction of Large Scale MIMO Systems
In order reduction of high order linear time invariant systems based on two-sided Krylov subspace methods, the Lanczos algorithm is commonly used to find the bases for input and output Krylov subspaces and to calculate the reduced order model by projection. However, this method can be numerically unstable even for systems with moderate number of states and can only find a limited number of bior...
متن کاملTwo-sided Arnoldi Algorithm and Its Application in Order Reduction of MEMS
In this paper we introduce a two-sided Arnoldi method that can be used in the reduction of high order systems, based on a two-sided Krylov subspace approach. The presented method can find better results than the well known Arnoldi algorithm and leads to the same reduced models as the (numerically unstable and more complicated) Lanczos algorithm. The new algorithm can find two orthogonal bases f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 38 شماره
صفحات -
تاریخ انتشار 2017